Minimum connected dominating sets and maximal independent sets in unit disk graphs
نویسندگان
چکیده
In ad hoc wireless networks, a connected dominating set can be used as a virtual backbone to improve the performance. Many constructions for approximating the minimum connected dominating set are based on the construction of a maximal independent set. The relation between the sizemis(G) of a maximum independent set and the size cds(G) of a minimum connected dominating set in the same graph G plays an important role in establishing the performance ratio of those approximation algorithms. Previously, it is known that mis(G) 4 · cds(G)+ 1 for all unit disk graphsG. In this paper, we improve it by showing mis(G) 3.8 · cds(G)+ 1.2. © 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Leveraging Linial's Locality Limit
In this paper we extend the lower bound technique by Linial for local coloring and maximal independent sets. We show that constant approximations to maximum independent sets on a ring require at least log-star time. More generally, the product of approximation quality and running time cannot be less than log-star. Using a generalized ring topology, we gain identical lower bounds for approximati...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملNew approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
Given a node-weighted graph, the minimum-weighted dominating set (MWDS) problem is to find a minimum-weighted vertex subset such that, for any vertex, it is contained in this subset or it has a neighbor contained in this set. And the minimum-weighted connected dominating set (MWCDS) problem is to find a MWDS such that the graph induced by this subset is connected. In this paper, we study these ...
متن کاملLocal Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes
Many protocols in distributed computing make use of dominating and connected dominating sets, for example for broadcasting and the computation of routing. Ad hoc networks impose an additional requirement that algorithms for the construction of such sets should be local in the sense that each node of the network should make decisions based only on the information obtained from nodes located a co...
متن کاملEfficient sub-5 approximations for minimum dominating sets in unit disk graphs
A unit disk graph is the intersection graph of n congruent disks in the plane. Dominating sets in unit disk graphs are widely studied due to their applicability in wireless ad-hoc networks. Because the minimum dominating set problem for unit disk graphs is NP-hard, numerous approximation algorithms have been proposed in the literature, including some PTASs. However, since the proposal of a line...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 352 شماره
صفحات -
تاریخ انتشار 2006